Scaling limits for the peeling process on random maps
نویسندگان
چکیده
منابع مشابه
Scaling limits of random planar maps with large faces
We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index α ∈ (1, 2). When the number n of vertices of the map tends to infinity, the asymptotic behavior of distances from a distinguished vertex is described by a random process called the continuous distance pr...
متن کاملScaling Limits for Workload Process
We study different scaling behavior of a very general telecommunications workload process. The activities of a telecommunication system are described by a marked point process ((Tn, Zn))n∈Z, where Tn is the arrival time of a packet brought to the system or the starting time of the activity of an individual source and the mark Zn is the amount of work brought to the system at time Tn. This model...
متن کاملThe Peeling Process of Infinite Boltzmann Planar Maps
We start by studying a peeling process on finite random planar maps with faces of arbitrary degrees determined by a general weight sequence, which satisfies an admissibility criterion. The corresponding perimeter process is identified as a biased random walk, in terms of which the admissibility criterion has a very simple interpretation. The finite random planar maps under consideration were re...
متن کاملOn the Sphericity of Scaling Limits of Random Planar Quadrangulations
We give a new proof of a theorem by Le Gall & Paulin, showing that scaling limits of random planar quadrangulations are homeomorphic to the 2-sphere. The main geometric tool is a reinforcement of the notion of Gromov-Hausdorff convergence, called 1-regular convergence, that preserves topological properties of metric surfaces.
متن کاملA note on the scaling limits of random Pólya trees
Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random Pólya trees: a uniform random Pólya tree of size n consists of a conditioned critical Galton-Watson tree Tn and many small forests, where with probability tending to one as n tends to infinity, each forest Fn(v) is maximally of size |Fn(v)| = O(log n). Their proo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2017
ISSN: 0246-0203
DOI: 10.1214/15-aihp718